The structure of strong arc-locally semicomplete digraphs
نویسندگان
چکیده
منابع مشابه
A classification of arc-locally semicomplete digraphs
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
متن کاملA classification of locally semicomplete digraphs
In [19] Huang gave a characterization of local tournaments. His characterization involves arc-reversals and therefore may not be easily used to solve other structural problems on locally semicomplete digraphs (where one deals with a fixed locally semicomplete digraph). In this paper we derive a classification of locally semicomplete digraphs which is very useful for studying structural properti...
متن کاملSpanning Local Tournaments in Locally Semicomplete Digraphs
We investigate the existence of a spanning local tournament with possibly high connectivity in a highly connected locally semicomplete digraph. It is shown that every (3k 2)-connected locally semicomplete digraph contains a k-connected spanning local tournament. This improves the result of Bang-Jensen and Thomassen for semicomplete digraphs and of Bang-Jensen [I] for locally semicomplete digrap...
متن کاملCycles of all lengths in arc-3-cyclic semicomplete digraphs
Let D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of length r. If vu f[ A(D) then the arc uv is contained in cycles of length h : 3<.h<<.r, or if 6+(D),f-(D)>~3 then the arc uv is contained in cycles of length h : 6<~h<~r. Also included in this paper is a very useful crossing arc theorem.
متن کاملThe complexity of colouring by locally semicomplete digraphs
In this paper we establish a dichotomy theorem for the complexity of homomorphisms to fixed locally semicomplete digraphs. It is also shown that the same dichotomy holds for list homomorphisms. The polynomial algorithms follow from a different, shorter proof of a result by Gutjahr, Welzl and Woeginger.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.01.011